The Minimum Substring Cover Problem
نویسندگان
چکیده
Article history: Received 21 April 2007 Revised 14 May 2008 Available online 26 June 2008
منابع مشابه
The Complexity of the Minimum k-Cover Problem
We consider the problem of determining the minimum cardinality collection of substrings, each of given length k ≥ 2, that “cover” a given string x of length n. We show first, by reduction from 3-SAT, that this minimum k-cover problem is NP-complete. Then we propose further two greedy algorithms that are believed to have a logarithmic approximation factor.
متن کاملThe Minimum k-Cover Problem
distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract We consider the problem of determining the minimum cardinality collection of substrings, each of given length k ≥ 2, that " cover " a given string x of length n. We describe an approach to solve this prob...
متن کاملThe Generalized Approximate Regularities in Strings
We concentrate on the generalized string regularities and study the minimum approximate λ-cover problem and the minimum approximate λ-seed problem of a string. Given a string x of length n and an integer λ, the minimum approximate λ-cover (resp. seed) problem is to find a set of λ substrings each of equal length that covers x (resp. a superstring of x) with the minimum error, under a variety of...
متن کاملSolving the Minimum String Cover Problem
A string cover C of a set of strings S is a set of substrings from S such that every string in S can be written as a concatenation of the strings in C. Given costs assigned to each substring from S, the Minimum String Cover (MSC) problem asks for a cover of minimum total cost. This NP-hard problem has so far only been approached from a purely theoretical perspective. A previous integer linear p...
متن کاملFinding a Good Collection of Patterns Covering a Set of Sequences iiContents
The papers in the series are intended for internal use and are distributed by the author. Copies may be ordered from the library of Department of Computer Science. Abstract. We consider a problem of learning of unions of pattern languages from positive examples. We consider three diierent classes of patterns-regular patterns, substring patterns and the so called PROSITE patterns. By regular pat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007